#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
void sort(int* p, int n)
{
	int i = 0;
	int j = 0;
	int tmp = 0;
	for (j = 0; j < 9; j++)
	{
		for (i = 0; i < 9-j; i++)
		{
			if ((*p) > (*(p + 1)))
			{
				 tmp = *p;
				*p = *(p + 1);
				*(p + 1) = tmp;
			}
			p = p + 1;
		}
		p = p - 9 + j;
	}
}

int main()
{
	int a[10] = { 0 };
	int i = 0;
	for (i = 0; i < 10; i++)
	{
		scanf("%d", &a[i]);
	}

	sort(a, 10);

	for (i = 0; i < 10; i++)
	{
		printf("%d ", a[i]);
	}
	return 0;
}


#include<stdio.h>
#include<string.h>

char* del(char* s)
{
	char* ps = s;
	char* p = s;
	int i = 0;
	for (i = 0; i < strlen(s); i++,p++)
	{
		if (*p != '*')
		{
			if (*p >= 97)
			{
				*ps = (*p) - 32;
				ps++;
			}
			else
			{
				*ps = *p;
				ps++;
			}
		}
	}
	*ps = '\0';
	return s;
}

int main()
{
	char a[80];
	gets(a);
	puts(del(a));
	return 0;
}

int find(int(*p)[5], int n, int* r, int* c)
{
	int i = 0;
	int j = 0;
	int max = 0;
	int flag = 0;
	for (i = 0; i < 5; i++, p++)
	{
		max = **p;
		for (j = 0,r = *p;j<5 ; j++,r = (*p) + 1)
		{
			if (*r > max)
			{
				flag = 
			}
		}
	}
}

int find(int(*p)[5], int n, int* r, int* c)
{
	int max = **p;
	*r = 0;
	*c = 0;
	for (int i = 0; i < n; i++)
	{
		for (int j = i + 1; j < n; j++)
		{
			if (*(*(p + i)+j) > max)
			{
				max = *(*(p + i) + j);
				*r = i;
				*c = j;
			}
		}
	}
	return max;
}

#include<stdio.h>
int main()
{
	int a[5][5] = { 0 };
	for (int i = 0; i < 5; i++)
	{
		for (int j = 0; j < 5; j++)
		{
			scanf("%d", &a[i][j]);
		}
	}
	int max = 0;
	int row = 0;
	int col = 0;
	max = find(a, 5, &row, &col);
	printf("%d %d %d", max, row, col);
	return 0;
}